منابع مشابه
Latent Dependency Forest Models
Figure 1: All possible pairwise dependencies between the three variables and a root node. Each dependency has a weight and only the dependencies with non-zero weights are shown. The weight ws|xi , which is the probability of generating a stop node given the assignment Xi = xi is not drawn for simplicity, but it can be computed using the normalization condition discussed in the LDFM-S subsection...
متن کاملNon-Projective Dependency Parsing via Latent Heads Representation (LHR)
In this paper we introduce a novel approach based on a bidirectional recurrent autoencoder to perform globally optimized non-projective dependency parsing via semisupervised learning. The syntactic analysis is completed at the end of the neural process that generates a Latent Heads Representation (LHR), without any algorithmic constraint and with a linear complexity. The resulting “latent synta...
متن کاملProbabilistic Models for High-Order Projective Dependency Parsing
This paper presents generalized probabilistic models for high-order projective dependency parsing and an algorithmic framework for learning these statistical models involving dependency trees. Partition functions and marginals for high-order dependency trees can be computed efficiently, by adapting our algorithms which extend the inside-outside algorithm to higher-order cases. To show the effec...
متن کاملPseudo-Projective Dependency Parsing
In order to realize the full potential of dependency-based syntactic parsing, it is desirable to allow non-projective dependency structures. We show how a datadriven deterministic dependency parser, in itself restricted to projective structures, can be combined with graph transformation techniques to produce non-projective structures. Experiments using data from the Prague Dependency Treebank s...
متن کاملMildly Non-Projective Dependency Grammar
Syntactic representations based on word-to-word dependencies have a long tradition in descriptive linguistics, and receive considerable interest in many computational applications. However, dependency syntax has remained somewhat of an island from a formal point of view, which hampers the exchange of resources and computational methods with other syntactic traditions. In this article, we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2891292